By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 26, Issue 4, pp. 873-1275

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

Pesech Feldman and Silvio Micali

pp. 873-933

BibTeX  Abstract Full Text:  PDF

Error-Resilient Optimal Data Compression

James A. Storer and John H. Reif

pp. 934-949

BibTeX  Abstract Full Text:  PDF

Constant-Time Randomized Parallel String Matching

Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, and Wojciech Rytter

pp. 950-960

BibTeX  Abstract Full Text:  PDF

Learning from Multiple Sources of Inaccurate Data

Ganesh Baliga, Sanjay Jain, and Arun Sharma

pp. 961-990

BibTeX  Abstract Full Text:  PDF

Singular and Plural Nondeterministic Parameters

Michal Walicki and Sigurd Meldal

pp. 991-1005

BibTeX  Abstract Full Text:  PDF

Data Structures' Maxima

G. Louchard, Claire Kenyon, and R. Schott

pp. 1006-1042

BibTeX  Abstract Full Text:  PDF

Oracles That Compute Values

Stephen Fenner, Steven Homer, Mitsunori Ogihara, and Alan Selman

pp. 1043-1065

BibTeX  Abstract Full Text:  PDF

Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs

J. R. Driscoll, D. M. Healy, Jr., and D. N. Rockmore

pp. 1066-1099

BibTeX  Abstract Full Text:  PDF

Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers

Leslie Ann Goldberg, Mark Jerrum, Tom Leighton, and Satish Rao

pp. 1100-1119

BibTeX  Abstract Full Text:  PDF

The Robot Localization Problem

Leonidas J. Guibas, Rajeev Motwani, and Prabhakar Raghavan

pp. 1120-1138

BibTeX  Abstract Full Text:  PDF

A Fast Algorithm for Optimally Increasing the Edge Connectivity

Dalit Naor, Dan Gusfield, and Charles Martel

pp. 1139-1165

BibTeX  Abstract Full Text:  PDF

Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture

Dorit Dor and Michael Tarsi

pp. 1166-1187

BibTeX  Abstract Full Text:  PDF

The Fourth Moment Method

Bonnie Berger

pp. 1188-1207

BibTeX  Abstract Full Text:  PDF

Testing Shared Memories

Phillip B. Gibbons and Ephraim Korach

pp. 1208-1244

BibTeX  Abstract Full Text:  PDF

Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications

Alexander V. Karzanov and S. Thomas McCormick

pp. 1245-1275

BibTeX  Abstract Full Text:  PDF